نتایج جستجو برای: polyhedral ambiguity set

تعداد نتایج: 681730  

 Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...

Journal: :International Mathematical Forum 2014

Journal: :IEEE Computer Graphics and Applications 1989

Journal: :IEEE Transactions on Aerospace and Electronic Systems 2021

Any reliable model for scheduling optical space-to-ground communication must factor in cloud cover conditions due to attenuation of the laser beam by water droplets clouds. In this article, we provide two alternative models uncertainty predictions: a robust optimization with polyhedral set and distributionally moment-based ambiguity set. We computationally analyze their performance over realist...

Journal: :IEEE Trans. Robotics and Automation 1997
Jui-Man Chiu Zen Chen Chao-Ming Wang

The 3-D reconstruction of visible polyhedral faces from a pair of general perspective views with the aid of a calibration plate is addressed. A polyhedron is placed on a planar calibration plate and two side views of both the polyhedron and the calibration plate are taken. Through proper arrangements we may assume that in the two views a number of polyhedral edges lying on the calibration plate...

Journal: :Computational Optimization and Applications 2021

A computational method is developed for solving time consistent distributionally robust multistage stochastic linear programs with discrete distribution. The structure of the uncertain parameters described by a scenario tree. At each node this tree, an ambiguity set defined conditional moment constraints to guarantee consistency. This employs idea nested Benders decomposition that incorporates ...

Journal: :Mathematical Programming 2022

We study a generalized distributionally robust chance-constrained set covering problem (DRC) with Wasserstein ambiguity set, where both decisions and uncertainty are binary-valued. establish the NP-hardness of DRC recast it as two-stage stochastic program, which facilitates decomposition algorithms. Furthermore, we derive two families valid inequalities. The first family targets hypograph “shif...

Journal: :Journal of Differential Geometry 2022

We adapt the method of Simon [26] to prove a $C^{1,\alpha}$-regularity theorem for minimal varifolds which resemble cone $\mathbf{C}^2_0$ over an equiangular geodesic net. For varifold classes admitting “no-hole” condition on singular set, we additionally establish near $\mathbf{C}^2_0 \times \mathbb{R}^m$. Combined with work Allard [2], [26], Taylor [29], and Naber–Valtorta [21], our result im...

Journal: :Journal of Mathematical Imaging and Vision 2006

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید